Abstract Hilbertian deductive systems, infon logic, and Datalog
نویسندگان
چکیده
Hilbertian Deductive Systems, Infon Logic, and Datalog Andreas Blassa,1,∗, Yuri Gurevich aMathematics Department, University of Michigan, Ann Arbor, MI 48109, USA bMicrosoft Research, One Microsoft Way, Redmond, WA 98052, USA
منابع مشابه
Hilbertian Deductive Systems, Infon Logic, and Datalog
In the first part of the paper, we develop a general method for converting derivability problems, from a broad range of deductive systems, into the derivability problem in a quite specific system, namely the Datalog fragment of universal Horn logic. In this generality, the derivability problems may not be recursively solvable, let alone feasible; in particular, we may get Datalog “programs” wit...
متن کاملFrom Primal Infon Logic with Individual Variables to Datalog
The logic core of Distributed Knowledge Authorization Logic, DKAL, is constructive logic with a quotation construct said. This logic is known as the logic of infons. The primal fragment of infon logic is amenable to linear time decision algorithms when policies and queries are ground. In the presence of policies with variables and implicit universal quantification, but no functions of positive ...
متن کاملA compiler for stratified Datalog programs: preliminary results
Deductive databases originated from the confluence between logic programming and databases. The core language of deductive databases is Datalog, which has recently found a renewed interest and new applications in several real-world problems. The evaluation of Datalog is traditionally implemented in monolithic systems that are generalpurpose in the sense that they are able to process an entire c...
متن کاملAnalysis of Sequential SLG Evaluation
SLG is a table-oriented resolution method that has the ability to combine the deductive database and logic programming paradigms. As an example of its applicability to deductive databases, SLG terminates and has polynomial data complexity for programs with nite models. In terms of the logic programming (and non-monotonic) paradigms, SLG computes the well-founded model for non-stratiied programs...
متن کاملEeciently Implementing Slg Resolution
SLG is a table-oriented resolution method that is gaining increasing attention due to its ability to combine the deductive database, non-monotonic reasoning and logic programming paradigms. SLG resembles SLD in that it admits a tuple-at-a-time resolution method, so it can make use of many of the techniques developed in implementing SLD over the past decade. Indeed, a program can contain any mix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 231 شماره
صفحات -
تاریخ انتشار 2013